Revision by Expansion in Logic Programs
نویسندگان
چکیده
We develop a formal framework for program expansion, studying properties as completeness, minimality and computational complexity of expansions. We think that program expansion is the best framework to study procedurally defined revision processes as proposed in truth maintenance and logic programming such as dependency-directed backtracking and the recently proposed contradiction removal semantics. Using the framework of program expansions we are able to determine the complexity profiles of these approaches as well as significant generalizations of both of them.
منابع مشابه
Belief Revision of Logic Programs under Answer Set Semantics
We address the problem of belief revision in (nonmonotonic) logic programming under answer set semantics: given logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P ∗ Q. Unlike previous approaches in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing...
متن کاملA general approach to belief change in answer set programming
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Unlike previous approaches to belief change in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing our results, we build upon the model theory of logic programs furnished by SE models. Since SE models provide ...
متن کاملA A Model-theoretic Approach to Belief Change in Answer Set Programming
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical int...
متن کاملBelief Revision in Non-Monotonic Reasoning and Logic Programming
In order to be able to explicitly reason about beliefs, we've introduced a non-monotonic formalism, called the Autoepistemic Logic of Beliefs, AEB, obtained by augmenting classical propositional logic with a belief operator, B. For this language we've deened the static autoepistemic expansions semantics. The resulting non-monotonic knowledge representation framework turned out to be rather simp...
متن کاملEmbedding Revision Programs in Logic Programming Situation Calculus
Revision programs were introduced by Marek and Truszczynski to specify change in knowledge bases. In this paper we show how to embed revision programs in logic programs with situation calculus notation. We extend Marek and Truszczynski's approach to allow incomplete initial knowledge base and extend the rules of revision programs to depend both on the initial and the nal knowledge base. We show...
متن کامل